Realizability models for BLL-like languages

نویسندگان

  • Martin Hofmann
  • Philip J. Scott
چکیده

We give a realizability model of Girard-Scedrov-Scott’s Bounded Linear Logic (BLL). This gives a new proof that all numerical functions representable in that system are polytime. Our analysis naturally justifies the design of the BLL syntax and suggests further extensions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular realizability problems and models of a generalized nondeterminism

Models of a generalized nondeterminism are defined by limitations on nondeterministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These notions are closely connected. In this paper we consider regular realizability problems for languages consisting of all prefixes of an infinite word. These pro...

متن کامل

Realizability for programming languages

We present a toy functional programming language inspired by our work on the PML language [22] together with a criterion ensuring safety and the fact that non termination can only occur via recursive programs. To prove this theorem, we use realizability techniques and a semantical notion of types. Important features of PML like polymorphism, proof-checking, termination criterion for recursive f...

متن کامل

Matching typed and untyped realizability ( Extended abstract )

Realizability interpretations of logics are given by saying what it means for computational objects of some kind to realize logical formulae. The computational objects in question might be drawn from an untyped universe of computation, such as a partial combinatory algebra, or they might be typed objects such as terms of a PCF-style programming language. In some instances, one can show that a p...

متن کامل

Realizability Toposes from Specifications

We investigate a framework of Krivine realizability with I/O effects, and present a method of associating realizability models to specifications on the I/O behavior of processes, by using adequate interpretations of the central concepts of pole and proof-like term. This method does in particular allow to associate realizability models to computable functions. Following recent work of Streicher ...

متن کامل

The Burkitt-like lymphomas: a Southwest Oncology Group study delineating phenotypic, genotypic, and clinical features.

The Revised European-American Lymphoma classification gives Burkitt-like lymphoma (BLL) provisional status, leaving unresolved the differential diagnosis with Burkitt lymphoma (BL) and diffuse large B-cell lymphoma (DLBCL). This study compared the biologic features of adult BLL and DLBCL. The phenotypic distinction between BLL and DLBCL was determined by immunohistochemical staining of frozen t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 318  شماره 

صفحات  -

تاریخ انتشار 2004